Burchard von Braunmühl, Computable Real Functions of Bounded Variation and Semi-computable Real Numbers
نویسندگان
چکیده
In this paper we discuss some basic properties of computable real functions of bounded variation (CBV-functions for short). Especially, it is shown that the image set of semi-computable real numbers under CBV-functions is a proper subset of the class of weakly computable real numbers; Two applications of CBV-functions to semi-computable real numbers produce the whole closure of semi-computable real numbers under total computable real functions, and the image sets of semicomputable real numbers under monotone computable functions and CBV-functions are different.
منابع مشابه
On the Effective Jordan Decomposability
The classical Jordan decomposition Theorem says that any real function of bounded variation can be expressed as a difference of two increasing functions. This paper explores the effective version of Jordan decomposition. We give a sufficient and necessary condition for those computable real functions of bounded variation which can be expressed as a difference of two computable increasing functi...
متن کاملEffectively Absolute Continuity and Effective Jordan Decomposability
Classically, any absolute continuous real function is of bounded variation and hence can always be expressed as a difference of two increasing continuous functions (socalled Jordan decomposition). The effective version of this result is not true. In this paper we give a sufficient and necessary condition for computable real functions which can be expressed as two computable increasing functions...
متن کاملComputable Functions of Bounded Variation and Semi-Computable Real Numbers
In this paper we discuss some basic properties of computable real functions which have bounded variations (CBV-functions for short). Especially, it is shown that the image set of semi-computable real numbers under CBV-functions is a proper subset of weakly computable real number class; Two applications of CBV-functions to semi-computable real numbers produce the whole closure of semi-computable...
متن کاملMonotonically Computable Real Numbers
A real number x is called k-monotonically computable (k-mc), for constant k > 0, if there is a computable sequence (xn)n∈N of rational numbers which converges to x such that the convergence is k-monotonic in the sense that k · |x−xn| ≥ |x−xm| for any m > n and x is monotonically computable (mc) if it is k-mc for some k > 0. x is weakly computable if there is a computable sequence (xs)s∈N of rat...
متن کاملDivergence bounded computable real numbers
A real x is called h-bounded computable, for some function h : N → N, if there is a computable sequence (xs) of rational numbers which converges to x such that, for any n ∈ N, at most h(n) non-overlapping pairs of its members are separated by a distance larger than 2−n. In this paper we discuss properties of h-bounded computable reals for various functions h. We will show a simple sufficient co...
متن کامل